Systems of polynomials with at least one positive real zero
نویسندگان
چکیده
منابع مشابه
construction of vector fields with positive lyapunov exponents
in this thesis our aim is to construct vector field in r3 for which the corresponding one-dimensional maps have certain discontinuities. two kinds of vector fields are considered, the first the lorenz vector field, and the second originally introced here. the latter have chaotic behavior and motivate a class of one-parameter families of maps which have positive lyapunov exponents for an open in...
15 صفحه اولExpected Norms of Zero-One Polynomials
Let An = ̆ a0 + a1z + · · · + an−1z : a j ∈ {0, 1} ̄ , whose elements are called zeroone polynomials and correspond naturally to the 2n subsets of [n] := {0, 1, . . . , n − 1}. We also let An,m = {α(z) ∈ An : α(1) = m}, whose elements correspond to the `n m ́ subsets of [n] of size m, and let Bn = An+1 \ An, whose elements are the zero-one polynomials of degree exactly n. Many researchers have stu...
متن کاملOn Polynomials of Least Deviation from Zero in Several Variables
A polynomial of the form x − p(x), where the degree of p is less than the total degree of x, is said to be least deviation from zero if it has the smallest uniform norm among all such polynomials. We study polynomials of least deviation from zero over the unit ball, the unit sphere and the standard simplex. For d = 3, extremal polynomial for (x1x2x3) on the ball and the sphere is found for k = ...
متن کاملLeast Squares Approximation by One-Pass Methods with Piecewise Polynomials
We propose several one-pass methods for data fitting in which a piecewise polynomial is used as an approximating function. The polynomial pieces are calculated step-by-step by the method of least squares as the data is -----------,scaIIIIed umy-once-from the begimring La tIre end. To calculate the least squares fitting in each step, we use three classes of data, namely: the data in the current ...
متن کامل“At least one” caching
We consider a variant of the caching problem, where each request is a set of pages of a fixed size, instead of a single page. In order to serve such a request, we require at least one of those pages to be present in the cache. Each page is assumed to have unit size and unit cost for getting loaded into the cache. We prove lower bounds on the competitive ratio for this problem in both the determ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2019
ISSN: 0219-4988,1793-6829
DOI: 10.1142/s0219498820501832